GPU-based offset surface computation using point samples
نویسندگان
چکیده
We present an efficient algorithm to perform approximate offsetting operations on geometric models using GPUs. Our approach approximates the boundary of an object with point samples and computes the offset by merging the balls centered at these points. The underlying approach uses Layered Depth Images (LDI) to organize the samples into structured points and performs parallel computations using multiple cores. We use spatial hashing to accelerate intersection queries and balance the workload among various cores. Furthermore, the problem of offsetting with a large distance is decomposed into successive offsetting using smaller distances. We derive bounds on the accuracy of offset computation as a function of the sampling rate of LDI and offset distance. In practice, our GPU-based algorithm can accurately compute offsets of models represented using hundreds of thousands of points in a few seconds on GeForce GTX 580 GPU. We observe more than 100 times speedup over prior serial CPU-based approximate offset computation algorithms.
منابع مشابه
GPU-Assisted Surface Reconstruction on Locally-Uniform Samples
In point-based graphics, surfaces are represented by point clouds without explicit connectivity. If the distribution of the points can be carefully controlled, surface reconstruction becomes a much easier problem. We present a simple, completely local surface reconstruction algorithm for input point distributions that are locally uniform. The locality of the computation lets us handle large poi...
متن کاملClosest Point Query among the Union of Convex Polytopes Using Rasterization Hardware
We present a novel approach using rasterization hardware to perform the following query: Given a collection of convex polytopes in 3D, find the closest point from some given point inside the polytopes to the surface of the union of the polytopes. The algorithm takes advantage of multi-pass rendering, clipping and depth tests. We also demonstrate its application to penetration depth computation.
متن کاملGPU Accelerated Molecular Surface Computing
A method is presented for computing the SES (solvent excluded surface) of a protein molecule in interactive-time based on GPU (graphics processing unit) acceleration. First, the offset surface of the van der Waals spheres is sampled using an offset distance d that corresponds to the radius of the solvent probe. The SES is then constructed by extracting the surface at distance d from the sample ...
متن کاملGenerating textures on Surfaces with Reaction-Diffusion systems in the GPU
In this paper we present a method to create textures on smooth surfaces of arbitrary topology using ReactionDiffusion systems in a graphics processing unit (GPU). To do this we use a parametrization of Catmull-Clark subdivision surfaces and obtain the metric information of the distortion caused by this parametrization, so we can calculate differential operators of functions defined on this surf...
متن کاملFast Hierarchical 3D Distance Transforms on the GPU
This paper describes a novel approach for the GPU-based computation of approximate 3D Euclidean distance transforms, i.e. distance fields with associated vector information to the closest object point. Our hierarchical method works on discrete voxel grids and uses a propagation technique, both on a single hierarchy level and between the levels. We assume a closed object, so that a signed distan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer-Aided Design
دوره 45 شماره
صفحات -
تاریخ انتشار 2013